منابع مشابه
On Competitive Recommendations
We are given an unknown binary matrix, where the entries correspond to preferences of users on items. We want to find at least one 1-entry in each row with a minimum number of queries. The number of queries needed heavily depends on the input matrix and a straightforward competitive analysis yields bad results for any online algorithm. Therefore, we analyze our algorithm against a weaker offlin...
متن کاملImplementing IWRM in Iran Recommendations Based on Global Experiences
IWRM is an empirical concept which has been founded on the experience of water practitioners. In other words, it is not a scientific theory to be confirmed or rejected. In turn, it is a set of guidelines derived from conventional understanding of key elements of water management. Experience shows that the countries and governments who start reforms in water sector, focus on policy making, and l...
متن کاملCompetitive Video on Demand
In this paper we investigate the online video on demand problem, namely having to accept or reject a request for a movie without knowing the future requests. We present online movie-scheduling schemes that implement the principles of refusal by choice and delayed noti cation. A novel way to schedule movies that exploits the knowledge of the distribution of the preference of requests for movies,...
متن کاملCompetitive Outcomes on Performance
-ABSTRACT A study examined cognitive and behaVioral * cOnsequences of continuous success orlailure in a competitive situation involving 40 undergiaduate males. Three performance .variables were selected for examination: expectancies for success, amount of self-motivated practice, and performance quality: Subjects were informed that they would be competing against anotber student in a best-three...
متن کاملOn Competitive Distribution Estimation
In this report, we discuss previous work on probability distribution estimation in the competitive sense, i.e. relative to an oracle that essentially knows the underlying distribution. Two natural limits on the oracle’s power are considered; in the first case, the oracle is assumed to know the distribution up to a permutation over the alphabet, and in the second, the oracle is assumed to know t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2016
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2015.10.034